Tom Nook, Capitalist or Comrade?

Tom.

Two algorithms for solving comrade linear systems

In this paper, we present an efficient computational and symbolic algorithms for solving comrade linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB is straightforward. An examples are given in order to illustrate the algorithms. 2006 Elsevier Inc. All rights reserved.

Or 625 — 3/4/2004 — Scribe: Tom Wexler

Recall from last time that we are working towards a 2-approximation algorithm for 1|prec|∑wjCj. We will focus on initial sets S, which have the property that if j ∈ S and k → j then k ∈ S. We defined ρ(S) = w(S) p(S) , and S ∗ to be an initial set with maximum ρ(S) over all initial sets S. Our algorithm finds S∗, finds a 2-approximate schedule for S∗ respecting precedence constraints, and then ...

Fiedler-comrade and Fiedler-Chebyshev pencils

Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basis, that include the classical Frobenius companion pencils as special cases. We generalize the definition of a Fiedler pencil from monomials to a larger class of orthogonal polynomial bases. In particular, we derive Fiedler-comrade pencils for two bases that are extremely important in practical ap...

Overtakable capitalist growth paths∗

Comparing a process of laborand capital-augmenting technical change directed by capitalists’ maximization of profits with a counterfactual in which decentralized innovation decisions are governed by noncapitalist property relations, I claim that if the two economies start from the same technology and capital stock there’s a date T such that after T per-capita consumption is always strictly grea...